Location:
Search - hash table
Search list
Description: roots--一个轻量级的内存数据库系统。基于Hash Map的table设计。快速轻巧。
Platform: |
Size: 112228 |
Author: icewind |
Hits:
Description: 跟rainbow table结合破解windoes登陆密码及各种hash密码
Platform: |
Size: 5115175 |
Author: yang |
Hits:
Description: 跟rainbow table结合破解windoes登陆密码及各种hash密码-Combined with the rainbow table to crack passwords and various landing windoes password hash
Platform: |
Size: 5114880 |
Author: yang |
Hits:
Description: 这是基于哈希函数的路由表的算法，对路由表的熟悉有很大的帮助。希望大家-Hash-based routing table and binary tree search algorithm
Platform: |
Size: 200704 |
Author: aww |
Hits:
Description: 一个基于（临界表）哈希类模版，里面包含了测试函数，及注释。-Based on the (critical table) hash-type template, which contains a test function, and the Notes.
Platform: |
Size: 1004544 |
Author: 过限于 |
Hits:
Description: 数据结构和算法，非常经典，讲的很详细！第一部分 基础知识
第一章 C++程序设计
第二章 程序性能
第二部分 数据结构
第三章 数据描述
第四章 数组和矩阵
第五章 堆栈
第六章 队列
第七章 跳表和散列
第八章 二叉树和其他树
第九章 优先队列
第十章 竞赛树
第十一章 搜索树
第十二章 图
第三部分 算法设计方法
第十三章 贪婪算法
第十四章 分而治之算法
第十五章 动态规划
第十六章 回溯
第十七章 分支定界-Data structures and algorithms, very classic, talked in great detail! The first part of the basic knowledge of first chapter C++ Program Design Chapter II The second part of the data structure of program performance data described in Chapter III Chapter IV Chapter V array and matrix stack, queue, Chapter VI Chapter VII Chapter VIII of the jump table and the hash Binary trees and other tree priority queue IX Chapter X Chapter XI competition tree search tree diagram the third part of Chapter XII Chapter XIII greedy algorithm design method of divide and conquer algorithms Chapter XIV Chapter XV of the dynamic programming algorithm for 16th Chapter XVII Chapter backtracking branch and bound
Platform: |
Size: 17229824 |
Author: 孙继磊 |
Hits:
Description: 布隆过滤器，Hash快速查表的改良快速算法，占用更少的空间-Bloom filter, Hash improved fast algorithm for fast look-up table, take up less space
Platform: |
Size: 1303552 |
Author: 李东辉 |
Hits:
Description: 哈希表构建查找，hash函数为取余法，处理冲突方法利用链地址法；实现建表，查找，插入，删除等功能；-The chain address Fa Haxi table constructed Find
Platform: |
Size: 2048 |
Author: 朱晓建 |
Hits:
Description: MD5是一个安全的散列算法，输入两个不同的明文不会得到相同的输出值，根据输出值，不能得到原始的明文，即其过程不可逆；所以要解密MD5没有现成的算法，只能用穷举法，把可能出现的明文，用MD5算法散列之后，把得到的散列值和原始的数据形成一个一对一的映射表，通过比在表中比破解密码的MD5算法散列值，通过匹配从映射表中找出破解密码所对应的原始明文。
对信息系统或者网站系统来说，MD5算法主要用在用户注册口令的加密，对于普通强度的口令加密，可以通过以下三种方式进行破解：
（1）在线查询密码。一些在线的MD5值查询网站提供MD5密码值的查询，输入MD5密码值后，如果在数据库中存在，那么可以很快获取其密码值。
（2）使用MD5破解工具。网络上有许多针对MD5破解的专用软件，通过设置字典来进行破解。
（3）通过社会工程学来获取或者重新设置用户的口令。
因此简单的MD5加密是没有办法达到绝对的安全的，因为普通的MD5加密有多种暴力破解方式，因此如果想要保证信息系统或者网站的安全，需要对MD5进行改造，增强其安全性，本文就是在MD5加密算法的基础上进行改进！
-MD5 is a secure hash algorithm, the two different input plaintext will not get the same output values can not be obtained based on the output value of the original plaintext, i.e. the process is not reversible so is not ready to decrypt MD5 algorithm which can be usedbrute-force method, the plaintext may occur, after the hash with the MD5 algorithm, the resulting hash value and the original data to form a one-to-one mapping table, cracks than the ratio in the table algorithm MD5 hash value of the passwordmatch from the mapping table to find crack the code corresponding to the original plaintext.
Information system or site system, the MD5 algorithm is mainly used in the user registered password encryption, password encryption for ordinary strength, can crack through the following three ways:
(1) for the codes. The MD5 value of some online website the the MD5 password value query input MD5 password value, exists in the database, you can quickly obtain the password va
Platform: |
Size: 274432 |
Author: Johnson |
Hits:
Description: A rainbow table is a precomputed table for reversing cryptographic hash functions, usually for cracking password hashes. Tables are usually used in recovering the plaintext password, up to a certain length consisting of a limited set of characters. It is a practical example of a space/time trade-off, using more computer processing time at the cost of less storage when calculating a hash on every attempt, or less processing time and more storage when compared to a simple lookup table with one entry per hash. Use of a key derivation function that employs a salt makes this attack infeasible.
Platform: |
Size: 1248256 |
Author: moro |
Hits:
Description: Simple packer, the loader is written in assembly (FASM) and the builder in Delphi.
For the technical part, this packer is good for:
- A non dependent code of its address with the delta offset
- Load API by hash
- Research in Export Address Table
- Import Address Table loading (ordinal & name)
- Use of NtCreateSection/NtMapViewOfSection
- The trick VirtualSize = SizeOfImage so that Windows don t steel our memory position.
Platform: |
Size: 232448 |
Author: Lord Noteworthy |
Hits:
Description: Hash page table alignment on newer cpus(CPU_FTR_ARCH_206) should be power of 2.
Platform: |
Size: 2048 |
Author: vhcuezm |
Hits:
Description: A hash performance instrumentation line in the object table.
Platform: |
Size: 3072 |
Author: sxrmri |
Hits:
Description: hash - hashing table processing.
Platform: |
Size: 14336 |
Author: nfhaqang |
Hits:
Description: Calculate hash of a table entry.
Platform: |
Size: 7168 |
Author: juizaoti |
Hits:
Description: hash - hashing table processing.
Platform: |
Size: 14336 |
Author: yakonmb |
Hits:
Description: hash - hashing table processing.
Platform: |
Size: 14336 |
Author: guedyvd |
Hits:
Description: hash - hashing table processing.
Platform: |
Size: 14336 |
Author: knnlnl |
Hits:
Description: 数据库中的散列法是使用计算值来分配表格数据的方法，它比在整个索引中搜索要好的多。一个哈希散列答应你在数据库表格中存储数据，以便这些行的要害计算的相同值存储在相同的位置。
只有那种数据量超大的数据库才会用到(Hashing in a database is a method of allocating tabular data using computed values, which is much better than searching in the entire index. A hash hash allows you to store data in the database table so that the same values for the key calculations of these rows are stored in the same location.
Only the large amount of data will be used in Databases)
Platform: |
Size: 2048 |
Author: jantc
|
Hits:
Description: 模拟彩虹表进行基于单词的密码攻击，读入一个字典之后将会得到哈希值，通过匹配哈希值来寻找密码。(Simulation of the rainbow table for word-based password attack, read a dictionary will be a hash value, by matching the hash value to find the password.)
Platform: |
Size: 76800 |
Author: evaendness
|
Hits:
«
1
2
...
34
35
36
37
38
39»